Slack due window assignment scheduling in the single-machine with controllable processing times

This article addresses resource allocation scheduling problems with slack due window on a single machine. Linear and convex are considered. Our goal is to determine the optimal schedule, window, allocation, minimizing various objective functions respect criteria (position-dependent weights number of early jobs, tardy starting time, size) consumption function. For linear problem, we study two cases where compression ration related job position respectively, provide lower bound jobs an upper jobs. bi-criteria analysis cost. Polynomial time algorithms developed for these problems.